Characterizations of ITBM-computability. II
نویسندگان
چکیده
منابع مشابه
From truth to computability II
Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and “truth” is understood as algorithmic solvability. Interactive computational problems, in turn, are defined as a certain sort games between a machine and its environment, with logical operators standing for operations on such games. Within the ambitious pr...
متن کاملNotions of computability at higher types II
In Part I of this series of papers [Lon01a] we gave a historical survey of the study of notions of higher-type computability. In the present paper and its sequel [Lon01b], we undertake a more systematic exposition of notions of higher-type computability, showing how many of the existing ideas and results can be fitted into a coherent framework. In Part II we will restrict our attention to notio...
متن کاملFormal Characterizations of Active Databases: Part II
1 I n t r o d u c t i o n a n d M o t i v a t i o n The core concept which makes a database system active is the concept of an active rule. The origin of the active rules is the production rule paradigm from the field of Artificial Intelligence with languages like OPS5 [8], used in expert systems. Typically, a production rule is of the form condition--+ action, where an inference engine cycles ...
متن کاملCharacterizations of Generalized Uniserial Algebras. Ii
Let SI be a finite dimensional algebra with unit element over a field. 21 is generalized uniserial if every primitive (left or right) ideal has a unique composition series. 21 is a UMFR algebra (an algebra with a unique minimal faithful representation) if 21 has only one faithful representation which is minimal with respect to being faithful. The notation used in this paper will be that of an e...
متن کاملCombinatorial Characterizations of Authentication Codes II
For any authentication code for k source states and v messages having minimum possible deception probabilities (namely, P d 0 = k=v and P d 1 = (k ? 1)=(v ? 1)), we show that there must be at least v encoding rules. (This can be thought of as an authentication-code analogue of Fisher's Inequality .) We derive several properties that an extremal code must satisfy, and we characterize the extrema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra i Logika
سال: 2021
ISSN: ['0373-9252']
DOI: https://doi.org/10.33048/alglog.2021.60.103